RankPL: A Qualitative Probabilistic Programming Language
نویسنده
چکیده
In this paper we introduce RankPL, a modeling language that can be thought of as a qualitative variant of a probabilistic programming language with a semantics based on Spohn’s ranking theory. Broadly speaking, RankPL can be used to represent and reason about processes that exhibit uncertainty expressible by distinguishing “normal” from “surprising” events. RankPL allows (iterated) revision of rankings over alternative program states and supports various types of reasoning, including abduction and causal inference. We present the language, its denotational semantics, and a number of practical examples. We also discuss an implementation of RankPL that is available for download.
منابع مشابه
Qualitative and Quantitative Reasoning in Hybrid Probabilistic Logic Programs
Reasoning with qualitative and quantitative uncertainty is required in some real-world applications [6]. However, current extensions to logic programming with uncertainty support representing and reasoning with either qualitative or quantitative uncertainty. In this paper we extend the language of Hybrid Probabilistic Logic programs [28, 25], originally introduced for reasoning with quantitativ...
متن کاملA probabilistic framework for automatic term recognition
Term recognition identifies domain-relevant terms which are essential for discovering domain concepts and for contributing to the construction of terminologies required by a wide range of natural language applications. Numerous techniques have been developed in an attempt to numerically determine or quantify termhood based on term characteristics. Some of the apparent shortcomings of existing t...
متن کاملAn Architecture for Knowledge Representation and Reasoning in Robotics
This paper describes an architecture that combines the complementary strengths of declarative programming and probabilistic graphical models to enable robots to represent, reason with, and learn from, qualitative and quantitative descriptions of uncertainty and knowledge. An action language is used for the low-level (LL) and high-level (HL) system descriptions in the architecture, and the defin...
متن کاملKR$^3$: An Architecture for Knowledge Representation and Reasoning in Robotics
This paper describes an architecture that combines the complementary strengths of declarative programming and probabilistic graphical models to enable robots to represent, reason with, and learn from, qualitative and quantitative descriptions of uncertainty and knowledge. An action language is used for the low-level (LL) and high-level (HL) system descriptions in the architecture, and the defin...
متن کاملA Qualitative Characterisation of Causal Independence Models Using Boolean Polynomials
Causal independence models offer a high level starting point for the design of Bayesian networks but are not maximally exploited as their behaviour is often unclear. One approach is to employ qualitative probabilistic network theory in order to derive a qualitative characterisation of causal independence models. In this paper we exploit polynomial forms of Boolean functions to systematically an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017